Discrete Duality for Rough Relation Algebras
نویسندگان
چکیده
Rough relation algebras are a generalization of relation algebras such that the underlying lattice structure is a regular double Stone algebra. Standard models are algebras of rough relations. A discrete duality is a relationship between classes of algebras and classes of relational systems (frames). In this paper we prove a discrete duality for a class of rough relation algebras and a class of frames.
منابع مشابه
THE DUALITY OF THE L?-REPRESENTATION ALGEBRA ?(S ) OF A FOUNDATION SEMIGROUP S AND FUNCTION ALGEBRAS
In the present paper for a large family of topological semigroups, namely foundation semigroups, for which topological groups and discrete semigroups are elementary examples, it is shown that ?(S) is the dual of a function algebra.
متن کاملSTONE DUALITY FOR R0-ALGEBRAS WITH INTERNAL STATES
$Rsb{0}$-algebras, which were proved to be equivalent to Esteva and Godo's NM-algebras modelled by Fodor's nilpotent minimum t-norm, are the equivalent algebraic semantics of the left-continuous t-norm based fuzzy logic firstly introduced by Guo-jun Wang in the mid 1990s.In this paper, we first establish a Stone duality for the category of MV-skeletons of $Rsb{0}$-algebras and the category of t...
متن کاملDiscrete dualities for n-potent MTL and BL-algebras
This talk is a contribution towards the project of developing discrete representability for the algebraic semantics of various non-classical logics. Discrete duality is a type of duality where a class of abstract relational systems is a dual counterpart to a class of algebras. These relational systems are referred to as ‘frames’ following the terminology of non-classical logics. There is no top...
متن کاملFull Duality among Graph Algebras and Flat Graph Algebras
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full dualizability, strong dualizability and entropicity are all equivalent. Any finite (flat) graph algebra which is not dualizable must be inherently non-κ-dualizable for every infinite cardinal κ. A new, general method for proving strong duality is presented.
متن کاملRough Relation Algebras Revisited
Rough relation algebras arise from Pawlak’s information systems by considering as object ordered pairs on a fixed set X . Thus, the subsets to be approximated are binary relations over X , and hence, we have at our disposal not only the set theoretic operations, but also the relational operators ; , ̆ , and the identity relation 1′. In the present paper, which is a continuation of [6], we furth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 127 شماره
صفحات -
تاریخ انتشار 2013